Arithmetic program paths

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Sequential Arrays: Pipelining Arithmetic Data Paths

Arithmetic algorithms typically use broadcasting for the distribution of control data to all bit slices in the data path. Since routing delays grow as a function of fanout and routing distance, broadcasting delays grow as a function of precision in arithmetic implementations. Broadcasting in the critical path degrades performance and causes implementations of diiering precisions to experience d...

متن کامل

Hamilton Paths in Certain Arithmetic Graphs

For each integer m ≥ 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x − m or y = mx or y = x/m. Our aim in this note is to show that, for each m, the graph Gm contains a Hamilton path. This answers a question of Lichiardopol. For each integer m ≥ 1, consider the graph Gm whose vertex set is the...

متن کامل

A Program for Geometric Arithmetic

As stated above, (A) is aimed at establishing a Non-Abelian Class Field Theory. The starting point here is the following classical result: Over a compact Riemann surface, a line bundle is of degree zero if and only if it is flat, i.e., induced from a representation of fundamental group of the Riemann surface. Clearly, being a bridge connecting divisor classes and fundamental groups, this result...

متن کامل

Calculi for Program Incorrectness and Arithmetic

This thesis is about the development and usage of deductive methods in two main areas: (i) the deductive dis-verification of programs, i.e., how techniques for deductive verification of programs can be used to detect program defects, and (ii) reasoning modulo integer arithmetic, i.e., how to prove the validity (and, in special cases, satisfiability) of first-order formulae that involve integer ...

متن کامل

Program extraction in exact real arithmetic

The importance of an abstract approach to a computation theory over general data types has been stressed by John Tucker in many of his papers. Ulrich Berger and Monika Seisenberger recently elaborated the idea for extraction out of proofs involving (only) abstract reals. They considered a proof involving coinduction of the proposition that any two reals in [−1, 1] have their average in the same...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGSOFT Software Engineering Notes

سال: 2005

ISSN: 0163-5948

DOI: 10.1145/1095430.1081721